/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
int n;
int w[10], v[10];
int dp[maxn];
void init()
{
    w[0] = 6, v[0] = 0;
    w[1] = 2, v[1] = 1;
    w[2] = 5, v[2] = 2;
    w[3] = 5, v[3] = 3;
    w[4] = 4, v[4] = 4;
    w[5] = 5, v[5] = 5;
    w[6] = 6, v[6] = 6;
    w[7] = 3, v[7] = 7;
    w[8] = 7, v[8] = 8;
    w[9] = 6, v[9] = 9;
}
int main()
{
    IOS;
    //0 1   2   3   4   5   6   7   8   9
    //6 2   5   5   4   5   6   3   7   6
    //0 0.5 0.4 0.6 1   1   1   2.3 1.1 1.5
    init();
    cin >> n;
    dp[0] = 0;
    for (int i = 1; i <= n; i++)
        dp[i] = -0x3f3f3f3f;
    for (int i = 0; i < 10; i++)
    {
        for (int j = w[i]; j <= n; j++)
        {
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }
    cout << dp[n] << endl;

    getchar();
    getchar();
    return 0;
}
